Evaluating Padé Approximants of the Matrix Logarithm
نویسنده
چکیده
The inverse scaling and squaring method for evaluating the logarithm of a matrix takes repeated square roots to bring the matrix close to the identity, computes a Padé approximant, and then scales back. We analyze several methods for evaluating the Padé approximant, including Horner’s method (used in some existing codes), suitably customized versions of the Paterson– Stockmeyer method and Van Loan’s variant, and methods based on continued fraction and partial fraction expansions. The computational cost, storage, and numerical accuracy of the methods are compared. We find the partial fraction method to be the best method overall and illustrate the benefits it brings to a transformation-free form of the inverse scaling and squaring method recently proposed by Cheng, Higham, Kenney, and Laub [SIAM J. Matrix Anal. Appl., 22 (2001), pp. 1112– 1125]. We comment briefly on how the analysis carries over to the matrix exponential.
منابع مشابه
Padé and Gregory error estimates for the logarithm of block triangular matrices
In this paper we give bounds for the error arising in the approximation of the logarithm of a block triangular matrix T by Padé approximants of the function f (x)= log[(1 + x)/(1 − x)] and partial sums of Gregory’s series. These bounds show that if the norm of all diagonal blocks of the Cayley-transform B = (T − I )(T + I )−1 is sufficiently close to zero, then both approximation methods are ac...
متن کاملConsiderations on Computing Real Logarithms of Matrices, Hamiltonian Logarithms, and Skew-symmetric Logarithms
In this work, the issue of computing a real logarithm of a real matrix is addressed. After a brief review of some known methods, more attention is paid to three methods: (i) Padé approximation techniques, (ii) Newton’s method, and (iii) a series expansion method. Newton’s method has not been previously treated in the literature; we address commutativity issues, and simplify the algorithmic form...
متن کاملFraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton–Padé, Hermite–Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given probl...
متن کاملGeneral order multivariate Padé approximants for Pseudo-multivariate functions. II
Explicit formulas for general order multivariate Padé approximants of pseudo-multivariate functions are constructed on specific index sets. Examples include the multivariate forms of the exponential function E (x) = ∞ ∑ j1,j2,...,jm=0 x1 1 x j2 2 · · ·x jm m (j1 + j2 + · · ·+ jm)! , the logarithm function L(x) = ∑ j1+j2+···+jm≥1 x1 1 x j2 2 · · ·x jm m j1 + j2 + · · ·+ jm , the Lauricella funct...
متن کاملAlgebraic properties of robust Padé approximants
For a recent new numerical method for computing so-called robust Padé approximants through SVD techniques, the authors gave numerical evidence that such approximants are insensitive to perturbations in the data, and do not have so-called spurious poles, that is, poles with a close-by zero or poles with small residuals. A black box procedure for eliminating spurious poles would have a major impa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 22 شماره
صفحات -
تاریخ انتشار 2001